Fuzzy rough sets, fuzzy preorders and fuzzy topologies S.P. Tiwari Indian School of Mines, Dhanbad, India The relationship between rough set theory and topological spaces is wellknown. One central observation in

Source URL: irafm.osu.cz

• Order theory
• General topology
• Fuzzy logic
• Preorder
• Binary relation
• Topological space
• Rough set
• Closure operator
• Closure
• Kazimierz Kuratowski
• Alexandrov topology
• Fuzzy subalgebra

Introduction to the Grok Language Ric Holt, 5 May 2002

Source URL: plg.uwaterloo.ca

• Mathematical logic
• Binary relation
• Grok Knowledge Base
• Transitive closure
• Function
• Equality
• FO
• Cartesian product
• Finitary relation
• Closure

KRDB RESEARCH CENTRE KNOWLEDGE REPRESENTATION MEETS DATABASES Faculty of Computer Science, Free University of Bozen-Bolzano, Piazza Domenicani 3, 39100 Bolzano, Italy Tel: +, fax: +, http://ww

Source URL: www.inf.unibz.it

• Mathematics
• Logic
• Mathematical logic
• Ontology
• Boolean algebra
• Mereology
• Predicate logic
• Algebraic logic
• ZermeloFraenkel set theory
• Binary relation
• Power set
• Mereotopology

The complexity of satisfaction problems in Reverse Mathematics Ludovic Patey Laboratoire PPS, Université Paris Diderot, Paris, FRANCE

Source URL: ludovicpatey.com

• Logic
• Mathematics
• Constraint programming
• Abstraction
• Model theory
• Boolean satisfiability problem
• Electronic design automation
• Logic in computer science
• Complexity of constraint satisfaction
• Constraint satisfaction problem
• Satisfiability
• Binary relation

On the relation between accuracy and fairness in binary classification ˇ Indr˙e Zliobait˙ e Aalto University and Helsinki Institute for Information Technology HIIT, Finland

Source URL: www.fatml.org

  :  A.1.8 Defining Acyclicity for an Undirected Graph An undirected graph can be represented as a binary relation, constrained to be symmetric. Write const

Source URL: softwareabstractions.org

Soc Choice Welfare: 413–431 DOI: s00355z The mere addition paradox, parity and critical-level utilitarianism Mozaffar Qizilbash

Source URL: www.repugnant-conclusion.com

• Mathematics
• Logic
• Physics
• 1
• Paradoxes
• Utilitarianism
• Mathematical logic
• Mere addition paradox
• Binary relation
• Equivalence relation
• Transitive relation
• Utility

Relation algebras as expanded FL-algebras Nikolaos Galatos and Peter Jipsen University of Denver and Chapman University

Source URL: spot.colorado.edu

• Mathematics
• Algebra
• Abstract algebra
• Algebraic logic
• Mathematical logic
• Fuzzy logic
• Boolean algebra
• Algebraic structures
• Residuated lattice
• Relation algebra
• Variety
• Binary relation

Chu Spaces Vaughan Pratt Stanford University Notes for the School on Category Theory and Applications University of Coimbra

Source URL: chu.stanford.edu

• Algebraic structures
• Chu space
• Semilattice
• Boolean algebra
• Structure
• Homomorphism
• Partially ordered set
• Lattice
• Adjoint functors
• Binary relation
• Isomorphism
• Dual space

Non-Wellfounded Mereology A binary relation R is said to be wellfounded on a domain if and only if every nonempty subset of that domain has an R-minimal element; equivalently, iff every descending R chain is finite. A p

Source URL: www.st-andrews.ac.uk